New approximation algorithms for graph coloring
نویسندگان
چکیده
منابع مشابه
Dynamic Algorithms for Graph Coloring
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (∆ + 1)vertex coloring and (2∆ − 1)-edge coloring in a graph with maximum degree ∆. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following th...
متن کاملNew Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n colors. There are no indications that coloring using say O(log n) colors is hard. It has been suggested that lift and project based SDP relaxations could be used to design algorithms that use n colors for arbitrarily small > 0. We explore this possibility in this pape...
متن کاملApproximation Algorithms for the Max-coloring Problem
Given a graph G = (V,E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize ∑k i=1 maxv∈Ciw(v). The problem arises in scheduling conflicting jobs in batches and in minimizing buffer size in dedicated memory managers. In this paper we present three approximation algorithms and one in...
متن کاملHybrid Evolutionary Algorithms for Graph Coloring
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a well-known tabu search algorithm. Experiments of such a hybrid algorithm are carried out on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1994
ISSN: 0004-5411,1557-735X
DOI: 10.1145/176584.176586